Trace Spaces: an Efficient New Technique for State-Space Reduction

State-space reduction techniques, used primarily in model-checkers, all rely on the idea that some actions are independent, hence could be taken in any (respective) order while put in parallel, without changing the semantics. It is thus not necessary to consider all execution paths in the interleaving semantics of a concurrent program, but rather some equivalence classes. The purpose of this paper is to describe a new algorithm to compute such equivalence classes, and a representative per class, which is based on ideas originating in algebraic topology. We introduce a geometric semantics of concurrent languages, where programs are interpreted as directed topological spaces, and study its properties in order to devise an algorithm for computing dihomotopy classes of execution paths. In particular, our algorithm is able to compute a control-flow graph for concurrent programs, possibly containing loops, which is "as reduced as possible" in the sense that it generates traces modulo equivalence. A preliminary implementation was achieved, showing promising results towards efficient methods to analyze concurrent programs, with very promising results compared to partial-order reduction techniques

Drawing quantum contextuality with 'dessins d'enfants'

The Frontiers Collection: "It from Bit orBit from It", ed. by A. Aguirre, B. Foster, Z. Meralli (Springer, 2014), pp 37-50International audienceIn the standard formulation of quantum mechanics, there exists an inherent feedback of the measurement setting on the elementary object under scrutiny. Thus one cannot assume that an 'element of reality' prexists to the measurement and, it is even more intriguing that unperformed/counterfactual observables enter the game. This is called quantum contextuality. Simple finite projective geometries are a good way to picture the commutation relations of quantum observables entering the context, at least for systems with two or three parties. In the essay, it is further discovered a mathematical mechanism for 'drawing' the contexts. The so-called 'dessins d'enfants' of the celebrated mathematician Alexandre Grothendieck feature group, graph, topological, geometric and algebraic properties of the quantum contexts that would otherwise have been 'hidden' in the apparent randomness of measurement outcomes

Tools, Objects, and Chimeras: Connes on the Role of Hyperreals in Mathematics

We examine some of Connes' criticisms of Robinson's infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes' own earlier work in functional analysis. Connes described the hyperreals as both a "virtual theory" and a "chimera", yet acknowledged that his argument relies on the transfer principle. We analyze Connes' "dart-throwing" thought experiment, but reach an opposite conclusion. In S, all definable sets of reals are Lebesgue measurable, suggesting that Connes views a theory as being "virtual" if it is not definable in a suitable model of ZFC. If so, Connes' claim that a theory of the hyperreals is "virtual" is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren't definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in his Noncommutative Geometry, raising the question whether the latter may not be vulnerable to Connes' criticism of virtuality. We analyze the philosophical underpinnings of Connes' argument based on Goedel's incompleteness theorem, and detect an apparent circularity in Connes' logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace (featured on the front cover of Connes' magnum opus) and the Hahn-Banach theorem, in Connes' own framework. We also note an inaccuracy in Machover's critique of infinitesimal-based pedagogy.Comment: 52 pages, 1 figur